On Squaring Krylov Subspace Iterative Methods for Nonsymmetric Linear Systems
نویسنده
چکیده
The Biorthogonal Lanczos and the Biconjugate Gradients methods have been proposed as iterative methods to approximate the solution of nonsymmetric and indefinite linear systems. Sonneveld [19] obtained the Conjugate Gradient Squared by squaring the matrix polynomials of the Biconjugate Gra dients method. Here we square the Biorthogonal Lanczos, the Biconjugate Residual and the Biconjugate Orthodir(2) methods. We make theoretical and experimental comparisons.
منابع مشابه
New variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...
متن کاملOn the squared unsymmetric Lanczos method
The biorthogonal Lanczos and the biconjugate gradient methods have been proposed as iterative methods to approximate the solution of nonsymmetric and indefinite linear systems. Sonneveld (1989) obtained the conjugate gradient squared by squaring the matrix polynomials of the biconjugate gradient method. Here we square the unsymmetric (or biorthogonal) Lanczos method for computing the eigenvalue...
متن کاملFast Nonsymmetric Iterations and Preconditioning for Navier-Stokes Equations
Discretization and linearization of the steady-state Navier-Stokes equations gives rise to a nonsymmetric indeenite linear system of equations. In this paper, we introduce preconditioning techniques for such systems with the property that the eigenvalues of the preconditioned matrices are bounded independently of the mesh size used in the discretization. We connrm and supplement these analytic ...
متن کاملA Parallel Krylov-Type Method for Nonsymmetric Linear Systems
Parallel Krylov (S-step and block) iterative methods for linear systems have been studied and implemented in the past. In this article we present a parallel Krylov method based on block s-step method for nonsymmetric linear systems. We derive two new averaging algorithm to combine several approximations to the solution of a single linear system using the block method with multiple initial guess...
متن کاملSolving large systems arising from fractional models by preconditioned methods
This study develops and analyzes preconditioned Krylov subspace methods to solve linear systems arising from discretization of the time-independent space-fractional models. First, we apply shifted Grunwald formulas to obtain a stable finite difference approximation to fractional advection-diffusion equations. Then, we employee two preconditioned iterative methods, namely, the preconditioned gen...
متن کامل